Descriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata

Previously, self-verifying symmetric difference automata were defined and a tight bound of 2n−1−1 was shown for state complexity in the unary case. We now consider the non-unary case and show that, for every n≥ 2, there is a regular languageLn accepted by a non-unary self-verifying symmetric difference nondeterministic automaton with n states, such that its equivalent minimal deterministic finite automaton has 2n−1 states. Also, given any SV-XNFA with n states, it is possible, up to isomorphism, to find at most another |GL(n,Z2)|− 1 equivalent SV-XNFA.